Edge-cuts leaving components of order at least three

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Edge Cut of Graphs Leaving Components of Order at Least Five

An edge cut of a connected graph is 5-restricted if its removal leaves every component having order at least five. Graphs that contain 5-restricted edge cuts are characterized in this paper. As a result, it is shown that a connected graph G of order at least 13 contains 5-restricted edge cuts if and only if G \ v contains a component of order at least five for every vertex v of graph G.

متن کامل

On the existence of edge cuts leaving several large components

We characterize graphs of large enough order or large enough minimum degree which contain edge cuts whose deletion results in a graph with a specified number of large components. This generalizes and extends recent results due to Ou (Edge cuts leaving components of order at least m, Discrete Math. 305 (2005), 365-371) and Zhang and Yuan (A proof of an inequality concerning k-restricted edge con...

متن کامل

Edge-cuts in Graphs

In an earlier paper [3], we studied cycles in graphs that intersect all edge-cuts of prescribed sizes. Passing to a more general setting, we examine the existence of T -joins in grafts that intersect all edge-cuts whose size is in a given set A ⊆ {1, 2, 3}. In particular, we characterize all the contractionminimal grafts admitting no T -joins that intersect all edge-cuts of size 1 and 2. We als...

متن کامل

Disjoint cycles of order at least 5

We prove that if G is a graph of order at least 5k with k ≥ 2 and the minimum degree of G is at least 3k then G contains k disjoint cycles of length at least 5. This supports the conjecture by Wang [Australas. J. Combin. 54 (2012), 59–84]: if G is a graph of order at least (2d+1)k and the minimum degree of G is at least (d+1)k with k ≥ 2 then G contains k disjoint cycles of length at least 2d+ 1.

متن کامل

Existence of at least three weak solutions for a quasilinear elliptic system

In this paper, applying two theorems of Ricceri and Bonanno, we will establish the existence of three weak solutions for a quasilinear elliptic system. Indeed, we will assign a differentiable nonlinear operator to a differential equation system such that the critical points of this operator are weak solutions of the system. In this paper, applying two theorems of R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(02)00385-0